Thesis in Computer Science – Computability, Randomness and Ergodic Theory on Metric Spaces – Sum Up
نویسنده
چکیده
Entropies. Several notions of entropies have been defined along the twentieth century. The role of an entropy is to quantify the uncertainty one has about the state of a – physical as well as mathematical – system, whose states are modeled as points of a mathematical space. The expression information content is also used in place of entropy, as uncertainty can be thought as lack of information. The theories which deal with these quantities are consequently called information theories. The space may be endowed with different structures, which lead to different notions of entropy :
منابع مشابه
Non-linear ergodic theorems in complete non-positive curvature metric spaces
Hadamard (or complete $CAT(0)$) spaces are complete, non-positive curvature, metric spaces. Here, we prove a nonlinear ergodic theorem for continuous non-expansive semigroup in these spaces as well as a strong convergence theorem for the commutative case. Our results extend the standard non-linear ergodic theorems for non-expansive maps on real Hilbert spaces, to non-expansive maps on Ha...
متن کاملCoupled coincidence point in ordered cone metric spaces with examples in game theory
In this paper, we prove some coupled coincidence point theorems for mappings with the mixed monotone property and obtain the uniqueness of this coincidence point. Then we providing useful examples in Nash equilibrium.
متن کاملComputability of the ergodic decomposition
The study of ergodic theorems from the viewpoint of computable analysis is a rich field of investigation. Interactions between algorithmic randomness, computability theory and ergodic theory have recently been examined by several authors. It has been observed that ergodic measures have better computability properties than non-ergodic ones. In a previous paper we studied the extent to which non-...
متن کاملIrreversible computable functions
The strong relationship between topology and computations has played a central role in the development of several branches of theoretical computer science: foundations of functional programming, computational geometry, computability theory, computable analysis. Often it happens that a given function is not computable simply because it is not continuous. In many cases, the function can moreover ...
متن کاملConcrete Models of Computation for Topological Algebras
A concrete model of computation for a topological algebra is based on a representation of the algebra made from functions on the natural numbers. The functions computable in a concrete model are computable in the representation in the classical sense of the Chruch-Turing Thesis. Moreover, the functions turn out to be continuous in the topology of the algebra. In this paper we consider different...
متن کامل